Confidential data sharing and anonymous entity resolution

ABSTRACT

A method, program and system for processing data is disclosed. The data comprises identifiers of a plurality of entities. The method, program and system comprising the steps of: (a) receiving one or more records, each record having a plurality of identifiers, each record corresponding with at least one entity, (b) utilizing a cryptographic algorithm to process at least two of the plurality of identifiers in the record, (c) sometimes after transmitting the processed record to a separate system or database, comparing the processed record to previously stored data; (d) matching the processed record with previously stored data that is determined to reflect the entity, the previously stored data that is determined to reflect the entity comprising at least a portion of at least two previously received records and/or based upon another identifier; and/or (e) associating the processed record with previously stored data that is determined to reflect a relationship with the entity.

CROSS-REFERENCE TO RELATED APPLICATION

The present application claims the benefit of provisional applicationNo. 60/424,240, filed in the United States Patent Office on Nov. 6,2002.

FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable.

TECHNICAL FIELD

This invention relates to processing and retrieving data in a databaseand, more particularly, to a submission, comparison andmatching/associating of data in a confidential and anonymous manner.

BACKGROUND OF THE INVENTION

In the wake of Sep. 11, 2001 events, various parties (e.g.,corporations, governmental agencies or natural persons) face a commondilemma: how can parties share specific information (e.g., a terroristwatch list, black list or a list of actual or potential problematicentities) that would assist the same or separate parties in detectingthe presence of potential terrorists or other problematic parties, whilemaintaining the security and confidentiality of such information andseparating any information that is not relevant to the matter?

Hesitation to contribute or otherwise disclose, as well as lawsgoverning the use and disclosure of, certain information is predicatedupon a concern that the information could be used in a manner that wouldviolate privacy or otherwise cause damage to the party. Such damagecould include identity theft, unauthorized direct marketing activities,unauthorized or intrusive governmental activities, protected class(e.g., racial, religious, gender, ethnic) profiling and discrimination,anti-competitive practices, defamation and/or credit or economic damage.

In response to this dilemma, or any situation requiring the sharing ofconfidential data, it would be beneficial to have a system whereinvarious parties may contribute data to an internal or external processor repository in a manner that: (a) sufficiently identifies each recordin the data (e.g., a source and record number) without disclosing anyentity-identifiable data (e.g., name or social security number); (b)prepares the data so: (i) identical unique value(s) results from samedata regardless of source and (ii) such data can be transmitted in astandard, but confidential, format to protect the confidentiality andsecurity of the data, (c) compares the data to previously contributeddata while the data is still in the confidential format, (d) constructsan identifiable entity (such as by utilizing a persistent key andanalyzing and enhancing the record with confidential representations ofpotential aliases, addresses, numbers and/or other identifyinginformation) through matching of the compared data, (e) constructsrelated entities through an association of the compared data, and/or (f)generates messages for appropriate parties (such as with relevant recordidentifying elements—e.g., a source and record number), such messagessometimes sent in a confidential manner, such as: (i) on an intervalbasis and/or wherein at least one message is noise (e.g., a message thatdoes not correspond with a match or relation, but is issued to minimizecertain vulnerabilities corresponding with traffic pattern analysis) and(ii) after such message has been processed through a reversiblecryptographic algorithm (e.g., encoding, encryption or other algorithmused to engender a level of confidentiality, but can be reversed, suchas by using decoding or decryption).

Current systems use various means to transfer data in a relativelyconfidential manner within or between parties. For example, some currentsystems use a reversible cryptographic algorithm, which modifies thedata in order to engender some level of confidentiality and lower therisk of losing data during transmission, prior to transmitting data withthe understanding that the recipient will use a comparable decoding ordecryption method (i.e., an algorithm that reverses, returns or modifiesthe encoded/encrypted data to a format representative of the originaldata) in order to decipher and understand the data. However, once thedata is deciphered, such data is subject to analysis and use in a mannerthat could cause the very damage that the encoding/encryption processwas intended to protect against.

Other current systems use irreversible cryptographic algorithms (e.g., aone-way functions, such as MD-5 or other algorithm used to engender alevel of confidentiality, but is irreversible) often as a documentsignature to make unauthorized document alteration detectable when thedocument is being shared across parties. Indeed, several existingirreversible cryptographic algorithms cause data to: (a) result in anidentical unique value for same data regardless of source and (b) beundecipherable and irreversible to protect the confidentiality andsecurity of the data. Any minor alteration (such as an extra space) inthe data results in a different value after the use of the irreversiblecryptographic algorithm as compared with data that does not have theminor alteration, even if the data is otherwise the same. Some currentsystems utilize an irreversible cryptographic algorithm to process aportion of the data and then match and merge records on a one-to-onebasis based upon identical processed data. For example, current systemsin a hospital may process the social security numbers in electronicpatient records through a one-way function and then match and mergerecords on a one-to-one basis in a database based upon the processedsocial security numbers.

However, there are no existing systems that, at a minimum: (a) matchreceived data—after at least a portion of such received data isprocessed through a cryptographic algorithm (e.g., reversiblecryptographic algorithm, such as encoding or decryption, or anirreversible cryptographic algorithm, such as a one-way function)—withdata previously stored in a database on a one-to-many or many-to-manybasis (i.e., received data consists of one or more records that matchesdata previously stored in a database, the matched data previously storedin a database comprising more than one previously received record),limiting the ability in current systems to build upon identifiableentities while the data is still in a confidential format, (b) movebeyond the initial match process to analyze whether any additionalinformation is gained in the initial match and then match other datapreviously stored in a database based upon the additional information,further limiting the current systems ability to construct identifiableentities, (c) utilizing all or part of those functions identified in (a)and (b) in this paragraph, to match not only same entities, butassociate various entities that are determined to be related in somemanner (e.g., a passenger on an airline reservation list is a roommateof a natural person on an airline watch list) and/or (d) issue aplurality of messages wherein at least one of the plurality of messagesis merely noise.

As such and in addition, there are no existing systems that can use thecryptographic algorithm to share and compare confidential data(including, without limitation, by leaving personally identifiableinformation in a cryptographic format), construct identifiable orrelated entities and message the appropriate entities in a manner thatmaintains security and confidentiality of the original data.

The present invention is provided to address these and other issues.

SUMMARY OF THE INVENTION

It is an object of the invention to provide a method, program and systemfor processing data in a database. The method, program and systempreferably comprise the steps of: (a) receiving one or more records,each record having a plurality of identifiers (e.g., a plurality of datavalues of known types, such as two (2) data values of “John”corresponding with a known “first name” type and “Smith” correspondingwith a known “last name” type, which is sometimes emanating from onedata value which is parsed into separate values corresponding withseparate known types, such as when an original data value of John Smithcorresponding with a known “name” type is parsed into two (2) datavalues of John corresponding with a “first name” type and Smithcorresponding with a “last name” type), each record corresponding withat least one entity, (b) utilizing a cryptographic algorithm to processat least two of the plurality of identifiers in the record, (c)sometimes, after transmitting the processed record to a separate systemor database, comparing the processed record to previously stored data;and (d) matching the processed record with previously stored data thatis determined to reflect the entity, the previously stored data that isdetermined to reflect the entity comprising at least a portion of atleast two previously received records.

It is yet further contemplated that the method, program and systemfurther comprise the steps of: (a) assigning or identifying a source tothe record (e.g., an organization providing the record, a particularsystem within the organization, and a unique identifier representing therecord in the particular system), (b) adding salt (i.e., additional dataused to pad, modify, skew, or coat the processed data) to the recordprior to the use of the cryptographic algorithm, and (c) sometimesdeciphering at least a portion of the processed record (such as thesource) after the step of matching the processed record with thepreviously stored data that is determined to reflect the entity.

It is further contemplated that the method, program and system furthercomprise the step of analyzing the record prior to the step of utilizinga cryptographic algorithm, which may include: (a) comparing theidentifier against a user-defined criterion (such as a user-definedstandard) or one or more data sets in a secondary database (such asquerying the secondary database for a secondary identifier) or list and(b) enhancing the record, such as by: (i) generating at least onevariant to at least one identifier and including the variant(s) with therecord and (ii) supplementing the record with the secondaryidentifier(s).

It is further contemplated that the method, program and system furthercomprise the steps of converting the record into a standard messageformat. For example, the method, program and system may convert therecord into a standard message format by utilizing a type indicator(e.g., a designation, variable, tag or other indicator correspondingwith a type, such as an XML tag corresponding with a type, such as nameor phone number) for each of the identifiers. By way of further example,where the record contains three (3) identifiers corresponding with one(1) last name type and two (2) phone number types, a standardizedrecord, utilizing <2> as the type indicator for the last name type and<3> as the type indicator for the phone number type, may result in thefollowing: <2>Smith</2><3>111-222-3333</3><3>222-111-3131</3>. It isfurther contemplated that the type indicator may be discernable afterthe step of utilizing the cryptographic algorithm. For example, thestandardized record set forth above in this paragraph, may result in thefollowing after being processed in the cryptographic algorithm:<2>23ff0ad398gl3ef82kcks83cke821apw</2><3>bcke39sck30cvk1002ckwlAeMn301L3b</3><3>23kaPek309cwf319oc3f921ldks8773q</3>.

It is further contemplated that the step of matching the processedrecord includes the steps of: (a) retrieving the previously stored datahaving the identical identifier(s), (b) evaluating whether anotheridentifier is included in the processed record that does not exist inthe previously stored data, (c) analyzing the previously stored data fora match to the processed record based on the another identifier; (d)repeating the steps until the previously stored data is analyzed for amatch to the processed record based upon the another identifier; and (e)assigning a persistent key (i.e., a unique numeric or alphanumericidentifier that, at a minimum, may be used to distinguish one or morerecords corresponding with a particular entity from other recordscorresponding with a different entity) associated with at least aportion of the previously stored data to the matched processed record.To the extent that the persistent key of the previously stored data ischanged as a result of any matching, the system may save any priorpersistent key(s) with a reference to the changed persistent key.

It is further contemplated that the method, program and system includesthe steps of: (a) issuing one or more messages based upon a user-definedrule, such as: (i) wherein the message includes the source of the recordand/or the source(s) of the previously stored data, which could be usedto identify the relevant information in the other source(s), (ii)wherein at least one of the messages is noise, and/or (iii) inuser-defined intervals and/or (b) storing the processed record in adatabase.

It is further contemplated that the method, process and system includethe steps of: (a) receiving a record having a plurality of identifiers,the record corresponding with an entity, (b) utilizing a cryptographicalgorithm to process at least two of the plurality of identifiers in therecord (sometimes analyzing the record prior to utilizing thecryptographic algorithm), (c) comparing the processed record topreviously stored data, (d) matching the processed record withpreviously stored data that is determined to reflect the entity basedupon at least one of the plurality of identifiers, (e) analyzing whetheranother identifier is included in the processed record that is notincluded in the matched previously stored data; and (f) matching thematched data with secondary previously stored data that is determined toreflect the entity based upon the another identifier (sometimes storingthe processed record in a database).

It is yet further contemplated that the method, system and programfurther comprise the steps of: (a) receiving a record having a pluralityof identifiers, the record corresponding with an entity, (b) utilizing acryptographic algorithm to process at least a portion of the record(sometimes analyzing and enhancing the record prior to utilizing thecryptographic algorithm), (c) comparing the processed record topreviously stored data, and (d) associating the processed record withthe previously stored data that is determined to reflect a relationshipwith the entity, and (e) storing the relationships with the entity in adatabase.

It is yet further contemplated that the method, system, and programfurther comprise the step of assigning a persistent key to the processedrecord.

It is yet further contemplated that the method, system, and programfurther comprise the steps of: (a) receiving a record having a pluralityof identifiers, the record corresponding with an entity and at least oneof the plurality of identifiers having previously been processedutilizing a cryptographic algorithm; (b) comparing the record topreviously stored data, at least a portion of the previously stored datahaving been processed utilizing the cryptographic algorithm; (c)matching the record with the previously stored data that is determinedto reflect the entity and/or associating the record with the previouslystored data that is determined to reflect a relationship with theentity; and (d) issuing a plurality of messages wherein at least one ofthe plurality of messages is noise.

These and other aspects and attributes of the present invention will bediscussed with reference to the following drawings and accompanyingspecification.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a functional block diagram of the system in accordance withthe invention.

FIG. 2 is a flowchart of the receive and process the record steps.

FIG. 3 is a flowchart of the Analyze record block in FIG. 2.

FIG. 4 is a flowchart of the Compare Conjoined Data block in FIG. 2.

FIGS. 5-7 are flowcharts further illustrating the Compare Conjoined Datablock in FIG. 2.

DETAILED DESCRIPTION OF THE INVENTION

While this invention is susceptible of embodiment in many differentforms, there is shown in the drawing, and will be described herein in adetailed, specific embodiment thereof with the understanding that thepresent disclosure is to be considered as an exemplification of theprinciples of the invention and is not intended to limit the inventionto the specific embodiment illustrated.

A data processing system 10 for processing data prior to, and in, adatabase is illustrated in FIGS. 1 through 7. The system 10 includes atleast one conventional computer 12 having a processor 14 and memory 16.The memory 16 is used both for storage of the executable software tooperate the system 10 and for storage of the data in a database andrandom access memory. All or part of the software may be embodied withinvarious applications and equipment, depending upon the relevantconfidentiality and security requirements. For example, the software maybe embodied, stored or provided on any computer readable mediumutilizing any of the following, at a minimum: (a) an installed softwareapplication on the source system, (b) a box unit that self-destroys theunit upon any tampering, and/or (c) a CD, DVD or floppy disc. Thecomputer 12 may receive inputs from one or more sources 18 ₁-18 _(n).

The data comprises one or more records having a plurality ofidentifiers. Each record corresponds with one or more entities. The oneor more entities may be natural persons, organizations, personalproperty, real property, proteins, chemical or organic compounds,biometric or atomic structures, or other items that can be representedby identifying data. For example, a record that contains identifiers forname, employer name, home address, work address, work telephone number,home telephone number, car license plate number, car type and socialsecurity number may correspond with, at a minimum, the followingentities: (a) natural person, (b) organization (e.g., employer orairline), and/or (c) property (e.g., car).

The system 10 receives the data from the one or more sources 18 ₁-18_(n) and processes each of the received records as illustrated in FIG.2. The software is stored in the memory 16 and is processed orimplemented by the processor 14.

As illustrated in FIG. 2, the system 10 receives the received record instep 20 and processed the received record in a manner that comprises thefollowing steps: (a) if the received record is not in a standard format(e.g., XML), converts the received record into a standard format in step22 and (b) identifies, assigns or otherwise attributes the record to asource (e.g., one or more identifiers that identifies the record in orto the source 18 ₁-18 _(n)— such as one or more primary keys of therecord such as organization ID, system ID and record ID) in step 24 (theidentifiers attributed to the source of the received record being“Attribution Data”). Alternatively, a coded cross-reference table issometimes used whereby the Attribution Data is represented by anattribution key and the attribution key is used to locate theAttribution Value when necessary.

The system 10 further processes the received record in step 20 byanalyzing and enhancing one or more of the plurality of identifiers ofthe received record in step 26 (the analyzed and enhanced identifiers ofthe record being “Enhanced Data”) through: (a) comparing at least aportion of the identifiers of the received record 20 to a user-definedcriteria and/or rules to perform several functions, such as: (i) namestandardization in step 28 (e.g., comparing to a root names list), (ii)address hygiene in step 30 (e.g., comparing to postal deliverystandards), (iii) geo-coding in step 32 (e.g., determining geographiclocations, such as latitude and longitude coordinates), (iv) fieldtesting or transformations in step 34 (e.g., comparing the gender fieldto confirm M/F or transforming Male to M), (v) user-defined formattingin step 36 (e.g., formatting all social security numbers in a999-99-9999 format) and/or (vi) variant generation and inclusion in step38 (e.g., common value alternatives or misspellings), (b) supplementingthe received record in step 40 by causing the system 10 to access one ormore databases in step 42 (which may contain the processing previouslyidentified, thus causing the system to access additional databases in acascading manner) to search for additional data (which may by submittedas new record(s) for receipt and processing in step 20) which can beadded to the received record in step 44, and (c) building and includinghash keys (e.g., a combination of certain data in the received record,such as the first three letters of a rooted first name, first fourletters of last name and last five numbers of a social security number)in step 46. Any new, modified or enhanced data can be stored in newlycreated fields to maintain the integrity of the original data. Byanalyzing and enhancing the identifiers in each record, identifierscorresponding with the same entity are more likely to match (eitherthrough the original identifiers or through the new, modified orenhanced data).

Thereafter, all or part of the Enhanced Data is processed through acryptographic algorithm and all or part of the Attribution Data issometimes processed through a cryptographic algorithm in step 48, whichmay include adding salt to the Enhanced Data or the Attribution Data,for protection and confidentiality, such as: (a) utilizing anirreversible cryptographic algorithm (e.g., one-way function) to processthe entity-identifiable Enhanced Data (the irreversible processed databeing “Anonymized Data”) and (b) sometimes utilizing a reversiblecryptographic algorithm (e.g., encryption or encoding) to process theAttribution Data (the reversible processed data being “ProtectedAttribution Data”).

The Anonymized Data and the Protected Attribution Data are thenconjoined in step 50 (and sometimes further processed through areversible cryptographic algorithm) (the conjoined Anonymized Data andthe Protected Attribution Data being the “Conjoined Data”) andtransferred, processed and saved in a repository (“Repository”) in step52.

The location of the Repository in step 52 is less critical because theConjoined Data in the Repository in step 52 will be in a confidentialformat. Furthermore, in this example, only the Attribution Data issusceptible to being reversed (e.g., decrypted or decoded) from theConjoined Data. As such, even if an unauthorized party was able toreverse the Attribution Data, such party would be unable to access, reador otherwise evaluate the Enhanced Data. However, the entirety of theConjoined Data may be used for comparison and identity recognition orcorrelation purposes, while maintaining confidentiality.

The system in the Repository in step 52 compares the Conjoined Data withpreviously stored data (such as from other sources and potentially awarehouse of stored data) and matches any data reflecting the same orrelated entities in step 54. As illustrated in FIG. 4, which issimilarly exemplified in an invention by the inventor submitted underthe title Real Time Data Warehousing, application Ser. No. 10/331,068,and published on Aug. 14, 2003 with publication number 2003/0154194A1,the system in the Repository analyzes the first identifier of theConjoined Data in step 56 and determines whether such identifier is acandidate list builder identifier (e.g., an identifier that may help indifferentiating between and across entities) in step 58. For example, anidentifier representing the social security number for a natural persontype entity is helpful in differentiating between and across entitiesand would be used to build a list of potential candidates that would beused for matching or relationship building. If the identifier is acandidate list builder identifier, the system would determine whetherthe identifier is generally distinctive across entities in step 60, suchas by comparing the identifier to a list of common identifiers anddetermining whether such identifier is on the list. The system woulddetermine whether there are any additional uncompared identifiers in theConjoined Data in step 62 if the identifier is: (a) not a candidate listbuilder identifier or (b) a candidate list builder identifier, but notgenerally distinctive across entities.

If the identifier is a candidate list builder and a generallydistinctive identifier, the system would retrieve all occurrences of theidentical identifier in the previously stored data in step 64, unlessthe system, based upon a user-defined criterion, determines that theidentifier ought not to be considered a generally distinctive identifierin step 66. For example, if: (a) the identifier represented a socialsecurity number and the processed value corresponded with the value of999-99-9999 (e.g., a value used in the source system as a default in theevent the social security number was unknown), and (b) the user-definedcriteria corresponding with the social security number identifiers wasto stop retrieving occurrences if the number of identical socialsecurity numbers reached fifty (50) (or some other set amount), at thepoint when the same social security number reached 51, the system woulddetermine that the social security number is not a generally distinctiveidentifier and would stop retrieving occurrences.

If the identifier is still considered to be a generally distinctiveidentifier in step 66, the retrieved occurrences are updated or added toa candidate list and relationship records in step 68. However, if thesystem determines that the identifier is not to be considered agenerally distinctive identifier in step 66, the system stops matchingbased upon the common identifier (such as by adding the identifier tothe list of common identifiers) in step 70 and may un-match previousrecords that were matched based upon the common identifier in step 72.Finally, the system determines whether there are any additionaluncompared identifiers in the Conjoined Data in step 62.

Once the system determines that there are no more uncompared identifiersin step 62, the system retrieves all of the identifiers used forconfidence and/or identity recognition (whether or not such identifiersare candidate building identifiers) corresponding to the candidate listin step 74 and compares the Conjoined Data with the candidate list instep 76 to enable the system to create confidence indicators (such as alikeness indicator and a related indicator) and update the candidatelist and relationship records with the confidence indicators in step 78.The system then determines whether there are any matches based upon thelikeness indicator in step 80 and if a match is identified, evaluateswhether the matched record(s) contains any new or previously unknownidentifiers in step 82 that may be candidate list builder identifiers toadd or update the candidate list/relationship records. This process isrepeated in step 84 until no further matches can be discerned. Thesystem would then assign all of the matched records the same persistentkey in step 86. If no matches were found for any record, the ConjoinedData would be assigned a new persistent key in step 88. Throughout theentire process, the system retains full attribution of the ConjoinedData and the matching process does not lose any data through a merge,purge or delete function.

Another example of the step of comparing Conjoined Data to previouslystored data to find matches of same entities is illustrated in FIGS. 5-7(and although not specifically identified, FIGS. 5-7 identifies severalfunctions used with respect to identifying associations of relatedentities). Starting from an empty database 90, Conjoined Data record one92 (emanating from company AAA, reservations system, record 21 withinthe reservation system, or AAA-Res-0021, and after being standardized,analyzed and enhanced, anonymized and conjoined) is received in theRepository. Given no records in the database 90, the system would findno occurrences of identical candidate list and generally distinctiveidentifiers (which may be based upon variants and/or hash keys to enable“fuzzy logic”-like capabilities) in the stored data, resulting in anempty candidate list in step 94. Given the empty candidate list, noidentifiers corresponding with the candidate list would be retrieved instep 96, no confidence indicators would be created, and therefore nolikeness matches would occur. As such, the system would assign a newpersistent key to the Conjoined Data record one and add the record tothe database in step 98.

As further illustrated in FIG. 6, the same process would occur whenConjoined Data record two is received in the Repository in step 100,such as emanating from Company BBB, Dining system, record 0486 in thedining system (or BBB-Din-0486). The system would retrieve alloccurrences of identical candidate list and generally distinctiveidentifiers in the stored data, identifying the same phone number (alongwith the persistent key) to be added to the candidate list in step 102.The system retrieves all identifiers corresponding to the candidatelist, resulting in the data corresponding with the first record beingretrieved in step 104. Based solely on a matched phone number, thesystem would create a relationship confidence indicator (such asindicating that the two individuals are roommates), but the telephonenumber match would not indicate a high confidence likeness match absentadditional information confirming the likeness, such as same name orsocial security number. As such, without a likeness confidence indicatorindicating a match, the system would assign the Conjoined Data recordtwo a new persistent key and add the record to the database in step 106.

As further illustrated in FIG. 7, upon receipt of a Conjoined Datarecord three in step 108, such as emanating from company CCC, car rentalsystem, record 0356 in the car rental system (or CCC-Car-0356), thesystem would retrieve all occurrences of identical candidate list andgenerally distinctive identifiers in the stored data, resulting in acandidate list identifying the social security number from ConjoinedData record one (along with the persistent key of Conjoined Data recordone) and driver's license number from Conjoined Data record two (alongwith the persistent key of Conjoined Data record two) in step 110. Thesystem would then retrieve all identifiers corresponding with thecandidate list showing all identifiers from the two previously storedrecords in step 112. The system could then create confidence indicatorsbased upon Conjoined Data record three and the retrieved data enablinglikeness confidence indicators to be created indicating a match. Basedupon the likeness matches, the system would assign the same persistentkey to all of the records and add the Conjoined Data record three to thedatabase in step 114. Sometimes, the prior persistent key correspondingwith Conjoined Data record two, PK: 00000002, would be saved with areference to the new persistent key, PK: 00000001, in order for thesystem to recognize at a later time that persistent key PK: 00000002 hassince been changed to persistent key PK: 00000001.

Furthermore, as illustrated on FIG. 2, the Conjoined Data and anyresulting relations and/or matches will be stored in step 116 and aseries of messages, sent based upon user-defined rules in step 118, suchas: (i) on a set interval basis, (ii) sometimes including a message thatis merely noise to minimize a traffic analysis attack, and/or (iii) withrespect to the true messages, identifying Protected Attribution Datafrom matched data. For example, relevant parties may be given theProtected Attribution Data (e.g., AAA-Res-0021, BBB-Din-0486 and/orCCC-Car-0356) which may be deciphered, although not the original datacorresponding with the Attribution Data (which is unknown to theRepository), thus enabling such organization to request or sharespecific records corresponding with the Attribution Data from or withother relevant parties. By way of further example, in circumstances whena match or relation has not been determined within the intervals, amessage of noise will be sent. Appropriate procedures would beestablished to maintain the confidentiality and security of theunderlying Attribution Data.

From the foregoing, it will be observed that numerous variations andmodifications may be effected without departing from the spirit andscope of the invention. It is to be understood that no limitation withrespect to the specific apparatus illustrated herein is intended orshould be inferred. It is, of course, intended to cover by the appendedclaims all such modifications as fall within the scope of the claims.

1. A method for processing data in a computer, comprising the steps of:receiving, in the computer, a record having a plurality of identifiers,the record corresponding to an entity; utilizing, in the computer, acryptographic algorithm to process at least two of the plurality ofidentifiers in the record to form a processed encrypted record;comparing, in the computer, the processed encrypted record to previouslystored encrypted data; matching, in the computer, the processedencrypted record with the previously stored encrypted data that isdetermined to reflect the entity, the previously stored encrypted datathat is determined to reflect the entity comprising at least a portionof at least one previously received record; and when the processedencrypted record matches with the previously stored encrypted data thatis determined to reflect the entity, performing, in the computer, thesteps of evaluating whether an additional identifier is included in theprocessed encrypted record that is not included in the previously storedencrypted data and updating the previously stored encrypted data toinclude the additional identifier as supplemental data in a newlycreated field in order to maintain the previously stored encrypteddata's integrity.
 2. The method of claim 1 further comprising the stepof one of assigning and identifying a source to the record.
 3. Themethod of claim 2 further comprising the step of deciphering at least aportion of the processed encrypted record after the step of matching theprocessed encrypted record with the previously stored encrypted datathat is determined to reflect the entity.
 4. The method of claim 3wherein the deciphered at least a portion of the processed encryptedrecord is the source.
 5. The method of claim 2 further comprising thestep of issuing a message based upon a user-defined rule.
 6. The methodof claim 5 wherein the message includes one of the source of the recordand at least one source of the previously stored encrypted data.
 7. Themethod of claim 5 wherein the step of issuing a message based upon auser-defined rule includes the step of issuing a message in user-definedintervals.
 8. The method of claim 1 further comprising the step ofmodifying the record prior to utilizing the cryptographic algorithm. 9.The method of claim 1 further comprising receiving a plurality ofreceived records.
 10. The method of claim 1 further comprising the stepof analyzing the record prior to the step of utilizing the cryptographicalgorithm to process at least a portion of the record.
 11. The method ofclaim 10 wherein the step of analyzing the record includes comparing atleast one of the plurality of identifiers against one of: a user-definedcriterion; and a data set in one of a secondary database and a list. 12.The method of claim 11 further comprising the step of enhancing therecord.
 13. The method of claim 12 wherein the step of enhancing therecord includes formatting the at least one of the plurality ofidentifiers in accordance with a user-defined standard.
 14. The methodof claim 12 wherein the step of enhancing the record includes generatinga variant to the at least one of the plurality of identifiers andincluding the variant with the record.
 15. The method of claim 12wherein the step of enhancing the record includes: querying the data setfor a secondary identifier relating to the record; and supplementing therecord with the secondary identifier.
 16. The method of claim 1 furthercomprising the step of converting the record into a standardized messageformat.
 17. The method of claim 16 wherein the step of converting therecord into a standardized message format includes the step of utilizinga type indicator corresponding with each of the plurality ofidentifiers.
 18. The method of claim 17 wherein the type indicator isdiscernable after the step of utilizing the cryptographic algorithm. 19.The method of claim 1 wherein the step of matching the processedencrypted record with the previously stored encrypted data that isdetermined to reflect the entity includes the steps of: retrieving thepreviously stored encrypted data having at least one of the plurality ofidentifiers; evaluating whether another identifier is included in theprocessed encrypted record that is not included in the previously storedencrypted data having the at least one of the plurality of identifiers;and analyzing the previously stored encrypted data having the at leastone of the plurality of identifiers for a match to the processedencrypted record based on the another identifier.
 20. The method ofclaim 19 wherein the step of matching the processed encrypted recordfurther comprises the step of retrieving a secondary previously storedencrypted data having the another identifier and including the secondarypreviously stored encrypted data with the previously stored encrypteddata having the at least one of plurality of identifiers.
 21. The methodof claim 1 wherein the step of matching the processed encrypted recordwith the previously stored encrypted data that is determined to reflectthe entity includes the step of assigning a persistent key associatedwith at least a portion of the previously stored encrypted data that isdetermined to reflect the entity to the matched processed encryptedrecord.
 22. The method of claim 1 further comprising the step of storingthe processed encrypted record in a database.
 23. The method of claim 1wherein the cryptographic algorithm is a reversible cryptographicalgorithm or an irreversible cryptographic algorithm.
 24. A method forprocessing data in a computer, comprising the steps of: receiving, inthe computer, a record having a plurality of identifiers, the recordcorresponding to an entity; utilizing, in the computer, a cryptographicalgorithm to process at least two of the plurality of identifiers in therecord to form a processed encrypted record; comparing, in the computer,the processed encrypted record to previously stored encrypted data;determining, in the computer, matched data by matching the processedencrypted record with the previously stored encrypted data that isdetermined to reflect the entity based upon the plurality ofidentifiers; analyzing, in the computer, whether another identifier isincluded in the processed encrypted record that is not included in thepreviously stored encrypted data that is determined to reflect theentity based upon the plurality of identifiers; matching, in thecomputer, the matched data with the previously stored encrypted datathat is determined to reflect the entity based upon the anotheridentifier; and updating, in the computer, the previously storedencrypted data to include the another identifier as supplemental data ina newly created field in order to maintain the previously storedencrypted data's integrity.
 25. The method of claim 24 furthercomprising the step of one of assigning and identifying a source to therecord.
 26. The method of claim 25 further comprising the step ofdeciphering at least a portion of the processed encrypted record afterthe step of matching the matched data.
 27. The method of claim 26wherein the deciphered at least a portion of the processed encryptedrecord is the source.
 28. The method of claim 25 further comprising thestep of issuing a message based upon a user-defined rule.
 29. The methodof claim 28 wherein the message includes one of the source of the recordand at least one source of the previously stored encrypted data.
 30. Themethod of claim 29 wherein the step of issuing a message based upon auser-defined rule includes the step of issuing a message in user-definedintervals.
 31. The method of claim 24 further comprising the step ofmodifying the record prior to utilizing the cryptographic algorithm. 32.The method of claim 24 wherein the received record comprises a pluralityof received records.
 33. The method of claim 24 further comprising thestep of analyzing the record prior to the step of utilizing thecryptographic algorithm to process at least a portion of the record. 34.The method of claim 33 wherein the step of analyzing the record includesthe step of comparing at least one of the plurality of identifiersagainst one of: a user-defined criterion and a data set in one of asecondary database and a list.
 35. The method of claim 34 furthercomprising the step of enhancing the record.
 36. The method of claim 35wherein the step of enhancing the record includes formatting the atleast one of the plurality of identifiers in accordance with auser-defined standard.
 37. The method of claim 35 wherein the step ofenhancing the record includes generating a variant to the at least oneof the plurality of identifiers and including the variant with therecord.
 38. The method of claim 35 wherein the step of enhancing therecord includes: querying the data set for a secondary identifierrelating to the record; and supplementing the record with the secondaryidentifier.
 39. The method of claim 24 further comprising the step ofconverting the record into a standardized message format.
 40. The methodof claim 39 wherein the step of converting the record into astandardized message format includes the step of utilizing a typeindicator corresponding with each of the plurality of identifiers. 41.The method of claim 40 wherein the type indicator is discernable afterthe step of utilizing the cryptographic algorithm.
 42. The method ofclaim 24 wherein the step of matching the matched data includes the stepof assigning a persistent key associated with at least a portion of thepreviously stored encrypted data that is determined to reflect theentity to the processed encrypted record.
 43. The method of claim 24further comprising the step of storing the processed encrypted record ina database.
 44. A method for processing data in a computer, comprisingthe steps of: receiving, in the computer, a record having a plurality ofidentifiers, the record corresponding to an entity; utilizing, in thecomputer, a cryptographic algorithm to process at least two of theplurality of identifiers in the record to form a processed encryptedrecord; comparing, in the computer, the processed encrypted record topreviously stored encrypted data; associating the processed encryptedrecord with the previously stored encrypted data that is determined toreflect a relationship with the entity; evaluating, in the computer,whether an additional identifier is included in the associated processedencrypted record that is not included in the previously stored encrypteddata; and updating, in the computer, the previously stored encrypteddata to include the additional identifier as supplemental data in anewly created field in order to maintain the previously stored encrypteddata's integrity.
 45. The method of claim 44 further comprising the stepof one of assigning and identifying a source to the record.
 46. Themethod of claim 45 further comprising the step of deciphering at least aportion of the processed encrypted record after the step of associatingthe processed encrypted record with the previously stored encrypted datathat is determined to reflect a relationship with the entity.
 47. Themethod of claim 46 wherein the deciphered at least a portion of theprocessed encrypted record is the source.
 48. The method of claim 45further comprising the step of issuing a message based upon auser-defined rule.
 49. The method of claim 48 wherein the messageincludes one of the source of the record and the source of thepreviously stored data.
 50. The method of claim 48 wherein the step ofissuing the message based upon the user-defined rule includes the stepof issuing a message in user-defined intervals.
 51. The method of claim44 further comprising the step of modifying the record prior toutilizing the cryptographic algorithm.
 52. The method of claim 44wherein the received record comprises a plurality of received records.53. The method of claim 44 wherein the previously stored encrypted datathat is determined to reflect the relationship with the entity comprisesat least a portion of two previously received records.
 54. The method ofclaim 44 further comprising the step of analyzing the record prior tothe step of utilizing the cryptographic algorithm to process at leasttwo of the plurality of identifiers in the record.
 55. The method ofclaim 54 wherein the step of analyzing the record includes comparing atleast one of the plurality of identifiers against one of: a user-definedcriterion; and a data set in one of a secondary database and a list. 56.The method of claim 55 further comprising the step of enhancing therecord.
 57. The method of claim 56 wherein the step of enhancing therecord includes formatting the at least one of the plurality ofidentifiers in accordance with a user-defined standard.
 58. The methodof claim 56 wherein the step of enhancing the record includes generatinga variant to the at least one of the plurality of identifiers andincluding the variant with the record.
 59. The method of claim 56wherein the step of enhancing the record includes: querying the data setfor a secondary identifier relating to the record; and supplementing therecord with the secondary identifier.
 60. The method of claim 44 furthercomprising the step of converting the record into a standardized messageformat.
 61. The method of claim 60 wherein the step of converting therecord into a standardized message format includes the step of utilizinga type indicator corresponding with each of the plurality ofidentifiers.
 62. The method of claim 61 wherein the type indicator isdiscernable after the step of utilizing the cryptographic algorithm. 63.The method of claim 44 further comprising the step of storing theprocessed encrypted record in a database.
 64. The method of claim 44further comprising the step of storing the relationships with the entityin a database.
 65. A method for processing data in a computer,comprising the steps of: receiving, in the computer, a record having aplurality of identifiers, the record corresponding with an entity and atleast one of the plurality of identifiers having previously beenencrypted utilizing a cryptographic algorithm, thereby resulting in aprocessed encrypted record; comparing, in the computer, the processedencrypted record to previously stored encrypted data, at least a portionof the previously stored encrypted data having previously been encryptedutilizing the cryptographic algorithm; matching, in the computer, theprocessed encrypted record with the previously stored encrypted datathat is determined to reflect the entity; issuing, in the computer, aplurality of messages in response to the match; evaluating, in thecomputer, whether an additional identifier is included in the matchedprocessed encrypted record that is not included in the previously storedencrypted data; and updating, in the computer, the previously storedencrypted data to include the additional identifier as supplemental datain a newly created field in order to maintain the previously storedencrypted data's integrity.
 66. The method of claim 65 wherein the stepof issuing a plurality of messages occurs in user-defined intervals. 67.The method of claim 65 wherein at least one of the plurality of messagesincludes a source of the record.
 68. The method of claim 65 furthercomprising the step of storing the record in a database.
 69. A methodfor processing data in a computer, comprising the steps of: receiving,in the computer, a record having a plurality of identifiers, the recordcorresponding with an entity and at least one of the plurality ofidentifiers having previously been encrypted utilizing a cryptographicalgorithm, thereby resulting in a processed encrypted record; comparing,in the computer, the processed encrypted record to previously storedencrypted data, at least a portion of previously stored data havingpreviously been encrypted utilizing the cryptographic algorithm, therebyresulting in the previously stored encrypted data; associating, in thecomputer, the processed encrypted record with the previously storedencrypted data that is determined to reflect a relationship with theentity; issuing, in the computer, a plurality of messages in response tothe associating step; evaluating, in the computer, whether an additionalidentifier is included in the associated processed encrypted record thatis not included in the previously stored encrypted data; and updating,in the computer, the previously stored encrypted data to include theadditional identifier as supplemental data in a newly created field inorder to maintain the previously stored encrypted data's integrity. 70.The method of claim 69 wherein the step of issuing a plurality ofmessages occurs in user-defined intervals.
 71. The method of claim 69wherein at least one of the plurality of messages includes a source ofthe record.
 72. The method of claim 69 further comprising the step ofstoring the record in a database.
 73. The method of claim 69 furthercomprising the step of storing the relationships with the entity in adatabase.
 74. A computer readable medium comprising a storage devicecontaining program instructions for execution by a computer that resultsin the computer performing a method comprising the steps of: receiving,in the computer, a record having a plurality of identifiers, the recordcorresponding to an entity; utilizing, in the computer, a cryptographicalgorithm to process at least two of the plurality of identifiers in therecord to form a processed encrypted record; comparing, in the computer,the processed encrypted record to previously stored encrypted data;matching, in the computer, the processed encrypted record with thepreviously stored encrypted data that is determined to reflect theentity, the previously stored encrypted data that is determined toreflect the entity comprising at least a portion of at least onepreviously received encrypted record; and when the processed encryptedrecord matches with the previously stored encrypted data that isdetermined to reflect the entity, performing, in the computer, the stepsof evaluating whether an additional identifier is included in theprocessed encrypted record that is not included in the previously storedencrypted data and updating the previously stored encrypted data toinclude the additional identifier as supplemental data in a newlycreated field in order to maintain the previously stored encrypteddata's integrity.
 75. The computer readable medium for performing themethod of claim 74 further comprising the step of one of assigning andidentifying a source to the record.
 76. The computer readable medium forperforming the method of claim 75 further comprising the step ofdeciphering at least a portion of the processed encrypted record afterthe step of matching the processed encrypted record with the previouslystored encrypted data that is determined to reflect the entity.
 77. Thecomputer readable medium for performing the method of claim 76 whereinthe deciphered at least a portion of the processed encrypted record isthe source.
 78. The computer readable medium for performing the methodof claim 75 further comprising the step of issuing a message based upona user-defined rule.
 79. The computer readable medium for performing themethod of claim 78 wherein the message includes one of the source of therecord and at least one source of the previously stored encrypted data.80. The computer readable medium for performing the method of claim 78wherein the step of issuing a message based upon a user-defined ruleincludes the step of issuing a message in user-defined intervals. 81.The computer readable medium for performing the method of claim 74further comprising the step of modifying the record prior to utilizingthe cryptographic algorithm.
 82. The computer readable medium forperforming the method of claim 74 further comprising receiving aplurality of received records.
 83. The computer readable medium forperforming the method of claim 74 further comprising the step ofanalyzing the record prior to the step of utilizing the cryptographicalgorithm to process at least a portion of the record.
 84. The computerreadable medium for performing the method of claim 83 wherein the stepof analyzing the record includes comparing at least one of the pluralityof identifiers against one of: a user-defined criterion; and a data setin one of a secondary database and a list.
 85. The computer readablemedium for performing the method of claim 84 further comprising the stepof enhancing the record.
 86. The computer readable medium for performingthe method of claim 85 wherein the step of enhancing the record includesformatting the at least one of the plurality of identifiers inaccordance with a user-defined standard.
 87. The computer readablemedium for performing the method of claim 85 wherein the step ofenhancing the record includes generating a variant to the at least oneof the plurality of identifiers and including the variant with therecord.
 88. The computer readable medium for performing the method ofclaim 85 wherein the step of enhancing the record includes: querying thedata set for a secondary identifier relating to the record; andsupplementing the record with the secondary identifier.
 89. The computerreadable medium for performing the method of claim 74 further comprisingthe step of converting the record into a standardized message format.90. The computer readable medium for performing the method of claim 89wherein the step of converting the record into a standardized messageformat includes the step of utilizing a type indicator correspondingwith each of the plurality of identifiers.
 91. The computer readablemedium for performing the method of claim 90 wherein the type indicatoris discernable after the step of utilizing the cryptographic algorithm.92. The computer readable medium for performing the method of claim 74wherein the step of matching the processed encrypted record with thepreviously stored encrypted data that is determined to reflect theentity includes the steps of: retrieving the previously stored encrypteddata having at least one of the plurality of identifiers; evaluatingwhether another identifier is included in the processed encrypted recordthat is not included in the previously stored encrypted data having theat least one of the plurality of identifiers; and analyzing thepreviously stored encrypted data having the at least one of theplurality of identifiers for a match to the processed encrypted recordbased on the another identifier.
 93. The computer readable medium forperforming the method of claim 92 wherein the step of matching theprocessed encrypted record further comprises the step of retrieving asecondary previously stored encrypted data having the another identifierand including the secondary previously stored encrypted data with thepreviously stored encrypted data having the at least one of plurality ofidentifiers.
 94. The computer readable medium for performing the methodof claim 74 wherein the step of matching the processed encrypted recordwith the previously stored encrypted data that is determined to reflectthe entity includes the step of assigning a persistent key associatedwith at least a portion of the previously stored encrypted data that isdetermined to reflect the entity to the matched processed encryptedrecord.
 95. The computer readable medium for performing the method ofclaim 74 further comprising the step of storing the processed encryptedrecord in a database.
 96. A computer readable medium comprising astorage device containing program instructions for execution by acomputer that results in the computer performing a method comprising thesteps of: receiving, in the computer, a record having a plurality ofidentifiers, the record corresponding to an entity; utilizing, in thecomputer, a cryptographic algorithm to process at least two of theplurality of identifiers in the record to form a processed encryptedrecord; comparing, in the computer, the processed encrypted record topreviously stored encrypted data; determining, in the computer, matcheddata by matching the processed encrypted record with the previouslystored encrypted data that is determined to reflect the entity basedupon the plurality of identifiers; analyzing, in the computer, whetheranother identifier is included in the processed encrypted record that isnot included in the previously stored encrypted data that is determinedto reflect the entity based upon the plurality of identifiers; matching,in the computer, the matched data with the previously stored encrypteddata that is determined to reflect the entity based upon the anotheridentifier; and updating, in the computer, the previously storedencrypted data to include the another identifier as supplemental data ina newly created field in order to maintain the previously storedencrypted data's integrity.
 97. The computer readable medium forperforming the method of claim 96 further comprising the step of one ofassigning and identifying a source to the record.
 98. The computerreadable medium for performing the method of claim 97 further comprisingthe step of deciphering at least a portion of the processed encryptedrecord after the step of matching the matched data.
 99. The computerreadable medium for performing the method of claim 98 wherein thedeciphered at least a portion of the processed encrypted record is thesource.
 100. The computer readable medium for performing the method ofclaim 96 further comprising the step of modifying the record prior toutilizing the cryptographic algorithm.
 101. The computer readable mediumfor performing the method of claim 96 wherein the received recordcomprises a plurality of received records.
 102. The computer readablemedium for performing the method of claim 96 further comprising the stepof analyzing the record prior to the step of utilizing the cryptographicalgorithm to process at least a portion of the record.
 103. The computerreadable medium for performing the method of claim 102 wherein the stepof analyzing the record includes the step of comparing at least one ofthe plurality of identifiers against one of: a user-defined criterionand a data set in one of a secondary database and a list.
 104. Thecomputer readable medium for performing the method of claim 103 furthercomprising the step of enhancing the record.
 105. The computer readablemedium for performing the method of claim 104 wherein the step ofenhancing the record includes formatting the at least one of theplurality of identifiers in accordance with a user-defined standard.106. The computer readable medium for performing the method of claim 104wherein the step of enhancing the record includes generating a variantto the at least one of the plurality of identifiers and including thevariant with the record.
 107. The computer readable medium forperforming the method of claim 104 wherein the step of enhancing therecord includes: querying the data set for a secondary identifierrelating to the record; and supplementing the record with the secondaryidentifier.
 108. The computer readable medium for performing the methodof claim 96 further comprising the step of converting the record into astandardized message format.
 109. The computer readable medium forperforming the method of claim 108 wherein the step of converting therecord into a standardized message format includes the step of utilizinga type indicator corresponding with each of the plurality ofidentifiers.
 110. The computer readable medium for performing the methodof claim 109 wherein the type indicator is discernable after the step ofutilizing the cryptographic algorithm.
 111. The computer readable mediumfor performing the method of claim 96 wherein the step of matching thematched data includes the step of assigning a persistent key associatedwith at least a portion of the previously stored data that is determinedto reflect the entity to the processed record.
 112. The computerreadable medium for performing the method of claim 96 further comprisingthe step of issuing a message based upon a user-defined rule.
 113. Thecomputer readable medium for performing the method of claim 112 whereinthe message includes one of the source of the record and at least onesource of the previously stored encrypted data.
 114. The computerreadable medium for performing the method of claim 113 wherein the stepof issuing a message based upon a user-defined rule includes the step ofissuing a message in user-defined intervals.
 115. The computer readablemedium for performing the method of claim 96 further comprising the stepof storing the processed encrypted record in a database.
 116. A computerreadable medium comprising a storage device containing programinstructions for execution by a computer that results in the computerperforming a method comprising the steps of: receiving, in the computer,a record having a plurality of identifiers, the record corresponding toan entity; utilizing, in the computer, a cryptographic algorithm toprocess at least two of the plurality of identifiers in the record toform a processed encrypted record; comparing, in the computer, theprocessed encrypted record to previously stored encrypted data;associating, in the computer, the processed encrypted record with thepreviously stored encrypted data that is determined to reflect arelationship with the entity; evaluating, in the computer, whether anadditional identifier is included in the associated processed encryptedrecord that is not included in the previously stored encrypted data; andupdating, in the computer, the previously stored encrypted data toinclude the additional identifier as supplemental data in a newlycreated field in order to maintain the previously stored encrypteddata's integrity.
 117. The computer readable medium for performing themethod of claim 116 further comprising the step of one of assigning andidentifying a source to the record.
 118. The computer readable mediumfor performing the method of claim 117 further comprising the step ofdeciphering at least a portion of the processed encrypted record afterthe step of associating the processed encrypted record with thepreviously stored encrypted data that is determined to reflect arelationship with the entity.
 119. The computer readable medium forperforming the method of claim 118 wherein the deciphered at least aportion of the processed encrypted record is the source.
 120. Thecomputer readable medium for performing the method of claim 116 furthercomprising the step of modifying the record prior to utilizing thecryptographic algorithm.
 121. The computer readable medium forperforming the method of claim 116 wherein the received record comprisesa plurality of received records.
 122. The computer readable medium forperforming the method of claim 116 wherein the previously storedencrypted data that is determined to reflect the relationship with theentity comprises at least a portion of two previously received records.123. The computer readable medium for performing the method of claim 116further comprising the step of analyzing the record prior to the step ofutilizing the cryptographic algorithm to process at least two of theplurality of identifiers in the record.
 124. The computer readablemedium for performing the method of claim 123 wherein the step ofanalyzing the record includes comparing at least one of the plurality ofidentifiers against one of: a user-defined criterion; and a data set inone of a secondary database and a list.
 125. The computer readablemedium for performing the method of claim 124 further comprising thestep of enhancing the record.
 126. The computer readable medium forperforming the method of claim 125 wherein the step of enhancing therecord includes formatting the at least one of the plurality ofidentifiers in accordance with a user-defined standard.
 127. Thecomputer readable medium for performing the method of claim 125 whereinthe step of enhancing the record includes generating a variant to the atleast one of the plurality of identifiers and including the variant withthe record.
 128. The computer readable medium for performing the methodof claim 125 wherein the step of enhancing the record includes: queryingthe data set for a secondary identifier relating to the record; andsupplementing the record with the secondary identifier.
 129. Thecomputer readable medium for performing the method of claim 116 furthercomprising the step of converting the record into a standardized messageformat.
 130. The computer readable medium for performing the method ofclaim 129 wherein the step of converting the record into a standardizedmessage format includes the step of utilizing a type indicatorcorresponding with each of the plurality of identifiers.
 131. Thecomputer readable medium for performing the method of claim 130 whereinthe type indicator is discernable after the step of utilizing thecryptographic algorithm.
 132. The computer readable medium forperforming the method of claim 116 further comprising the step ofissuing a message based upon a user-defined rule.
 133. The computerreadable medium for performing the method of claim 132 wherein themessage includes one of the source of the record and the source of thepreviously stored encrypted data.
 134. The computer readable medium forperforming the method of claim 132 wherein the step of issuing themessage based upon the user-defined rule includes the step of issuing amessage in user-defined intervals.
 135. The computer readable medium forperforming the method of claim 116 further comprising the step ofstoring the processed encrypted record in a database.
 136. The computerreadable medium for performing the method of claim 116 furthercomprising the step of storing the relationships with the entity in adatabase.
 137. A computer readable medium comprising a storage devicecontaining program instructions for execution by a computer that resultsin the computer performing a method comprising the steps of: receiving,in the computer, a record having a plurality of identifiers, the recordcorresponding with an entity and at least one of the plurality ofidentifiers having previously been encrypted utilizing a cryptographicalgorithm, thereby resulting in a processed encrypted record; comparing,in the computer, the processed encrypted record to previously storedencrypted data, at least a portion of the previously stored encrypteddata having previously been encrypted utilizing the cryptographicalgorithm; matching, in the computer, the processed encrypted recordwith the previously stored encrypted data that is determined to reflectthe entity; issuing, in the computer, a plurality of messages inresponse to the match; evaluating, in the computer, whether anadditional identifier is included in the matched processed encryptedrecord that is not included in the previously stored encrypted data; andupdating, in the computer, the previously stored encrypted data toinclude the additional identifier as supplemental data in a newlycreated field in order to maintain the previously stored encrypteddata's integrity.
 138. The computer readable medium for performing themethod of claim 137 wherein the step of issuing a plurality of messagesoccurs in user-defined intervals.
 139. The computer readable medium forperforming the method of claim 137 wherein at least one of the pluralityof messages includes a source of the record.
 140. The computer readablemedium for performing the method of claim 137 further comprising thestep of storing the record in a database.
 141. A computer readablemedium comprising a storage device containing program instructions forexecution by a computer that results in the computer performing a methodcomprising the steps of: receiving, in the computer, a record having aplurality of identifiers, the record corresponding with an entity and atleast one of the plurality of identifiers having previously beenencrypted utilizing a cryptographic algorithm, thereby resulting in aprocessed encrypted record; comparing, in the computer, the processedencrypted record to previously stored encrypted data, at least a portionof the previously stored encrypted data having previously been encryptedutilizing the cryptographic algorithm; associating, in the computer, theprocessed encrypted record with the previously stored encrypted datathat is determined to reflect a relationship with the entity; issuing,in the computer, a plurality of messages in response to the associatingstep; evaluating whether an additional identifier is included in theassociated processed encrypted record that is not included in thepreviously stored encrypted data; and updating, in the computer, thepreviously stored encrypted data to include the additional identifier assupplemental data in a newly created field in order to maintain thepreviously stored encrypted data's integrity.
 142. The computer readablemedium for performing the method of claim 141 wherein the step ofissuing a plurality of messages occurs in user-defined intervals. 143.The computer readable medium for performing the method of claim 141wherein at least one of the plurality of messages includes a source ofthe record.
 144. The computer readable medium for performing the methodof claim 141 further comprising the step of storing the record in adatabase.
 145. The computer readable medium for performing the method ofclaim 141 further comprising the step of storing the relationships withthe entity in a database.